Intermediate integer programming representations using value disjunctions
نویسندگان
چکیده
منابع مشابه
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set of vector values. The extended formulation is constructed by creating a new binary variable for each generated value. Initial experiments show that the extended formulation can have a more compact complete description ...
متن کاملLattice-free sets, branching disjunctions, and mixed-integer programming
In this paper we study the relationship between valid inequalities for mixed-integer sets, lattice-free sets associated with these inequalities and structured disjunctive cuts, especially the t-branch split cuts introduced by Li and Richard (2008). By analyzing n-dimensional lattice-free sets, we prove that every facet-defining inequality of the convex hull of a mixed-integer polyhedral set wit...
متن کاملOn the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound and cuttingplane algorithms for solving mixed integer linear programs. Such disjunctions can be used for branching at each iteration of the branch-and-bound algorithm or to generate split inequalities for the cutting-plane algorithm....
متن کاملOn the Complexity of Selecting Branching Disjunctions in Integer Programming
Branching is an important component of branch-and-bound algorithms for solving mixed integer linear programs. We consider the problem of selecting, at each iteration of the branchand-bound algorithm, a general branching disjunction of the form “πx ≤ π0∨πx ≥ π0+1”, where π, π0 are integral. We show that the problem of selecting an optimal such disjunction, according to specific criteria describe...
متن کاملAncestral Benders’ Cuts and Multi-term Disjunctions for Mixed-Integer Recourse Decisions in Stochastic Programming
This paper focuses on solving two-stage stochastic mixed integer programs (SMIPs) with general mixed integer decision variables in both stages. We develop a decomposition algorithm in which the first stage approximation is solved using a branch-and-bound tree with nodes inheriting Benders’ cuts that are valid for their ancestor nodes. In addition, we develop two closely related convexification ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2008
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.12.003